package lanQiaoBei.基础算法.位运算;
import java.io.*;
/*
* n的二进制表示中第k位是几(位从0开始)
* */
public class P1 {
      static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      static int n;
      public static void scan()throws Exception{
             n=Integer.parseInt(br.readLine());
      }
      public static void main(String[]args)throws Exception{
             scan();
             int k=0;
             while(Math.pow(2,k)<=n)k++;
             while(k>0){
                 k--;
                 System.out.print(n>>k & 1);
             }
      }
}
